Invariance of Stationary and Ergodic Properties of a Quantum Source under Memoryless Transformations∗
نویسندگان
چکیده
We prove that the stationarity and the ergodicity of a quantum source {ρ[1,m]}m=1 are preserved by any trace-preserving completely positive linear map of the tensor product form E⊗m, where a copy of E acts locally on each spin lattice site. We also establish ergodicity criteria for so called classically-correlated quantum sources.
منابع مشابه
Stationary quantum source coding
In this paper the quantum version of the source coding theorem is obtained for a completely ergodic source. This result extends Schumacher’s quantum noiseless coding theorem for memoryless sources. The control of the memory effects requires some earlier results of Hiai and Petz on high probability subspaces. Our result is equivalently considered as a compression theorem for noiseless stationary...
متن کاملua nt - p h / 99 12 10 3 v 1 2 2 D ec 1 99 9 Stationary quantum source coding
In this paper the quantum version of the source coding theorem is obtained for a completely ergodic source. This results extends Shannon’s classical theorem as well as Schumacher’s quantum noiseless coding theorem for memoryless sources. The control of the memory effects requires some earlier results of Hiai and Petz on high probability subspaces.
متن کاملA Study on Properties of Dempster-Shafer Theory to Probability Theory transformations
In this paper, five conditions that have been proposed by Cobb and Shenoy are studied for nine different mappings from the Dempster-Shafer theory to the probability theory. After comparing these mappings, one of the considerable results indicates that none of the mappings satisfies the condition of invariance with respect to the marginalization process. In more details, the main reason for this...
متن کاملOn Efficient Entropy Approximation via Lempel-Ziv Compression
We observe a classical data compression algorithm due to Lempel and Ziv, well-known to achieve asymptotically optimal compression on a wide family of sources (stationary and ergodic), to perform reasonably well even on short inputs, provided the source is memoryless. More precisely, given a discrete memoryless source with large alphabet and entropy bounded away from zero, and a source sequence ...
متن کاملOn Sliding Block Coding for Transmission of a Source over a Stationary Nonanticipatory Channel
It is shown that the capacity C'b of a stationary nonanticipatory channel with respect to block coding is at least as great as the capacity C~ of the channel with respect to sliding block coding. For several types of stationary nonanticipatory channels (namely, ergodic channels, channels with additive random noise, and averaged channels whose components are discrete memoryless channels), it is ...
متن کامل